Functionality and metagraph disintegration in boolean networks
نویسندگان
چکیده
منابع مشابه
Functionality and metagraph disintegration in boolean networks.
We study regulatory networks of N genes giving rise to a vector expression profile v(t) in which each gene is Boolean; either on or off at any time. We require a network to produce a particular time sequence v(t) for t∈1,…,T and parameterize the complexity of such a genetic function by its duration T. We establish a number of new results regarding how functional complexity constrains genetic re...
متن کاملOn circuit functionality in Boolean networks.
It has been proved, for several classes of continuous and discrete dynamical systems, that the presence of a positive (resp. negative) circuit in the interaction graph of a system is a necessary condition for the presence of multiple stable states (resp. a cyclic attractor). A positive (resp. negative) circuit is said to be functional when it "generates" several stable states (resp. a cyclic at...
متن کاملFuzzy Metagraph and Vague Metagraph based Techniques and their Applications
Metagraphs are graphical hierarchical structure in which every node is a set having one or more elements. Fuzzy Metagraph and Vague Metagraph are an emerging technique used in the design of many information processing systems like transaction processing systems, Decision Support Systems (DSS), and workflow Systems. In this paper, distinct matrixes have been proposed for Fuzzy Metagraph and Vagu...
متن کاملDisintegration of Sensorimotor Brain Networks in Schizophrenia.
BACKGROUND Schizophrenia is a severe mental disorder associated with derogated function across various domains, including perception, language, motor, emotional, and social behavior. Due to its complex symptomatology, schizophrenia is often regarded a disorder of cognitive processes. Yet due to the frequent involvement of sensory and perceptual symptoms, it has been hypothesized that functional...
متن کاملIdentification problems for Boolean networks and Boolean control networks
In this paper we address various forms of identification problems for Boolean networks (BNs) and for Boolean control networks (BCNs). For the former, we assume to have a set of infinite or finite support output trajectories and we want to identify a BN compatible with those trajectories. Conditions for the identified BN to coincide (up to a relabeling) with the original BN are provided. For BCN...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Theoretical Biology
سال: 2011
ISSN: 0022-5193
DOI: 10.1016/j.jtbi.2011.05.006